منابع مشابه
One-stack Automata as Acceptors of Context-free Languages*
This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in ...
متن کاملHow to ask for technical help? Evidence-based guidelines for writing questions on Stack Overflow
Context: The success of Stack Overflow and other community-based question-and-answer (Q&A) sites depends mainly on the will of their members to answer others’ questions. In fact, when formulating requests on Q&A sites, we are not simply seeking for information. Instead, we are also asking for other people’s help and feedback. Understanding the dynamics of the participation in Q&A communities is...
متن کاملBottom-Up Tree Acceptors
This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...
متن کاملConsensus Game Acceptors
We propose a game for recognising formal languages, in which two players with imperfect information need to coordinate on a common decision, given private input information. The players have a joint objective to avoid an inadmissible decision, in spite of the uncertainty induced by the input. We show that this model of consensus acceptor games characterises context-sensitive languages, and conv...
متن کاملUsing Acceptors as Transducers
We wish to use a given nondeterministic two-way multi-tape acceptor as a transducer by supplying the contents for only some of its input tapes, and asking it to generate the missing contents for the other tapes. We provide here an algorithm for assuring beforehand that this transduction always results in a finite set of answers. We also develop an algorithm for evaluating these answers whenever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1972
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(72)80021-7